Columnar Storage in SQL Server 2012

نویسندگان

  • Per-Åke Larson
  • Eric N. Hanson
  • Susan Price
چکیده

SQL Server 2012 introduces a new index type called a column store index and new query operators that efficiently process batches of rows at a time. These two features together greatly improve the performance of typical data warehouse queries, in some cases by two orders of magnitude. This paper outlines the design of column store indexes and batch-mode processing and summarizes the key benefits this technology provides to customers. It also highlights some early customer experiences and feedback and briefly discusses future enhancements for column store indexes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Storage Tiering for Microsoft Sql Server and Emc Symmetrix Vmax with Enginuity 5875

This white paper examines the application of managing Microsoft SQL Server in a storage environment utilizing multiple storage configurations to optimize performance costeffectiveness of storage allocations. Practical examples are provided of automated data movement between storage tiers to meet performance requirements for SQL Server databases and cost-effectiveness of EMC Symmetrix VMAXTM res...

متن کامل

Storage Tiering for Microsoft SQL Server and EMC Symmetrix VMAX with Enginuity 5874

This white paper examines the application of managing Microsoft SQL Server in a storage environment utilizing multiple storage configurations to optimize performance cost-effectiveness of storage allocations. Practical examples are provided of automated data movement between Storage Types to meet performance requirements for SQL Server databases and cost-effectiveness of EMC Symmetrix VMAXTM re...

متن کامل

FlashQueryFile: Flash-Optimized Layout and Algorithms for Interactive Ad Hoc SQL on Big Data

High performance storage layer is vital for allowing interactive ad hoc SQL analytics (OLAP style) over Big Data. The paper makes a case for leveraging flash in the Big Data stack to speed up queries. State-ofthe-art Big Data layouts and algorithms are optimized for hard disks (i.e., sequential access is emphasized over random access) and result in suboptimal performance on flash given its dras...

متن کامل

Generalized Parallel Join Algorithms and Designing Cost Models

Applications for large-scale data analysis use such techniques as parallel DBMS, MapReduce (MR) paradigm, and columnar storage. In this paper we focus in a MapReduce environment. The aim of this work is to compare the different join algorithms and designing cost models for further use in the query optimizer.

متن کامل

A Typical Case of Recommending the Use of a Hierarchical Data Format

Storing large amounts of data in an efficient way from the point of view of very fast retrieval is an important requirement for many industries like KEMA, a company offering consulting, testing and certification in the energy business. Because their relational database could not cope fast enough with the large amounts of data involved, an alternative way for data storage was proposed, called Hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Data Eng. Bull.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2012